Formal and Natural Proof - A phenomenological approach
نویسنده
چکیده
It is frequently claimed (see e.g. [Rav]) that the formalization of a mathematical proof requires a quality of understanding that subsumes all necessary acts for checking the proof and that, consequently, automatic proof checking cannot lead to an epistemic gain about a proof. We present a project developing what is sometimes called a ’fortified formalism’ and argue taking a phenomenological look at proof understanding, that proofs can be (and often are) given in a way that allows a formalization sufficient for producing an automatically checkable writeup, but does not subsume
منابع مشابه
?Logic and Formal Ontology: Is the Final Formal Ontology Possible
Musa Akrami AbstractMany philosophers and logicians have contemplated the relationship between ontology and logic. The author of this paper, working within a Bolzanoan-Husserlian tradition of studying both ontology and logic, considers ontology as the science of the most general features of beings and the most general relations among them. He considers logic as the science concernin...
متن کاملProof Theory and Formal Grammars – Applications of Normalization ∗
One of the main areas of interaction between logic and linguistics in the last 20 years has been the proof theoretical approach to formal grammars. This approach dates back to Lambek’s work in the 1950s. Lambek proposed to consider grammars as deductive systems, as studied in proof theory. Taking this point of view, we can use proof theoretical methods to study grammar formalisms. In this paper...
متن کاملIsar - A Generic Interpretative Approach to Readable Formal Proof Documents
We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interactive theorem proving systems that there is no appropriate notion of proof available that is suitable for human communication, or even just maintenance. Isar’s main aspect is its formal language for natural deduction proofs, whic...
متن کاملApplications of Proof Theory to Isabelle
Isabelle [3, 4] is a generic theorem prover. It suppports interactive proof in several formal systems, including first-order logic (intuitionistic and classical), higher-order logic, Martin-Löf type theory, and Zermelo-Fraenkel set theory. New logics can be introduced by specifying their syntax and rules of inference. Both natural deduction and sequent calculi are allowed. Isabelle’s approach i...
متن کاملOn the Ea-style Integrated Processing of Self-contained Mathematical Texts
In this paper 1 , we continue to develop our approach to theorem proof search in the EA-style, that is theorem proving in the framework of integrated processing mathematical texts written in a 1st-order formal language close to the natural language used in mathematical papers. This framework enables constructing a sound and complete goal-oriented sequent-type calculus with \large-block" inferen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013